منابع مشابه
Employing Approximate Equivalence for Design of Approximate Circuits
This thesis is concerned with the utilization of formal verification techniques in the design of the functional approximations of combinational circuits. We thoroughly study the existing formal approaches for the approximate equivalence checking and their utilization in the approximate circuit development. We present a new method that integrates the formal techniques into the Cartesian Genetic ...
متن کاملApproximate Bisimulation Equivalence and Variable Refinement
In this paper, we consider an operator for refinement of variables to be used in the design of hybrid system. Variables on a given level of abstraction are replaced by more complicated processes on a lower level just like the function are called in the program. Then we established the equivalence, bisimulation equivalence and approximate bisimulation equivalence which are by polynomial flow eve...
متن کاملA Method for Approximate Equivalence Checking
An approximate equivalence checking method is developed based on the use of partial Haar spectral diagrams (HSDs). Partial HSDs are defined and used to represent a subset of the Haar spectral coefficients for two functions. Due to the uniqueness properties of the Haar transform, a necessary condition for equivalence is that the individual coefficients must have the same value. The probability t...
متن کاملApproximate Equivalence of Markov Decision Processes
We consider the problem of finding the minimal ǫ-equivalent MDP for an MDP given in its tabular form. We show that the problem is NP-Hard and then give a bicriteria approximation algorithm to the problem. We suggest that the right measure for finding minimal ǫ-equivalent model is L1 rather than L∞ by giving both an example, which demonstrates the drawback of using L∞, and performance guarantees...
متن کاملNonseparable Graphs
Proof. We first prove the sufficiency. Since any two vertices of G are connected by two internally disjoint paths, then for each vertex v of G, any two vertices of G − v are connected by at least one path, i.e., c(G − v) = c(G). Hence G has no cut vertex. Next we prove the necessity. Let u, v be two distinct vertices of G. To show that there are internally disjoint paths between u and v, we app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1981
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1981-0613792-6